Multihomogeneous Newton methods
نویسندگان
چکیده
We study multihomogeneous analytic functions and a multihomogeneous Newton’s method for finding their zeros. We give a convergence result for this iteration and we study two examples: the evaluation map and the generalized eigenvalue problem.
منابع مشابه
Study of multihomogeneous polynomial systems via resultant matrices
Resultants provide conditions for the solvability of polynomial equations and allow reducing polynomial system solving to linear algebra computations. Sparse resultants depend on the Newton polytopes of the input equations. This polytope is the convex hull of the exponent vectors corresponding to the nonzero monomials of the equations (viewed as lattice points in the Cartesian space of dimensio...
متن کاملMultihomogeneous resultant matrices for systems with scaled support
Constructive methods for matrices of multihomogeneous (or multigraded) resultants for unmixed systems have been studied by Weyman, Zelevinsky, Sturmfels, Dickenstein and Emiris. We generalize these constructions to mixed systems, whose Newton polytopes are scaled copies of one polytope, thus taking a step towards systems with arbitrary supports. First, we specify matrices whose determinant equa...
متن کاملThe Expected Number of Real Roots of a Multihomogeneous System of Polynomial Equations
The methods of Shub and Smale [SS93] are extended to the class of multihomogeneous systems of polynomial equations, yielding Theorem 1, which is a formula expressing the mean (with respect to a particular distribution on the space of coefficient vectors) number of real roots as a multiple of the mean absolute value of the determinant of a random matrix. Theorem 2 derives closed form expressions...
متن کاملMultihomogeneous resultant formulae by means of complexes
The first step in the generalization of the classical theory of homogeneous equations to the case of arbitrary support is to consider algebraic systems with multihomogeneous structure. We propose constructive methods for resultant matrices in the entire spectrum of resultant formulae, ranging from pure Sylvester to pure Bézout types, and including matrices of hybrid type of these two. Our appro...
متن کاملJohann Radon Institute for Computational and Applied Mathematics
Constructive methods for matrices of multihomogeneous (or multigraded) resultants for unmixed systems have been studied by Weyman, Zelevinsky, Sturmfels, Dickenstein and Emiris. We generalize these constructions to mixed systems, whose Newton polytopes are scaled copies of one polytope, thus taking a step towards systems with arbitrary supports. First, we specify matrices whose determinant equa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 69 شماره
صفحات -
تاریخ انتشار 2000